Ordered stabbing of pairwise disjoint convex sets in linear time
نویسندگان
چکیده
منابع مشابه
Interval sequences and the combinatorial encoding of planar families of pairwise disjoint convex sets
We extend a combinatorial encoding of families of pairwise disjoint convex sets in the plane recently introduced by J. E. Goodman and R. Pollack to the case of families not in general position. This encoding generalizes allowable sequences, which encode finite planar point sets. Further we prove several results on realizability questions, and discuss a number of different combinatorial properti...
متن کاملBuilding Convex Space Partitions Induced by Pairwise Interior-disjoint Simplices
Given a set S of n pairwise interior-disjoint (d?1)-simplices in d-space, for d 3, a Convex Space Partition induced by S (denoted CSP(S)) is a partition of d-space into convex cells such that the interior of each cell does not intersect the interior of any simplex in S. In this paper it is shown that a CSP(S) of size O(n d?1) can be computed deterministically in time O(n d?1). These bounds are ...
متن کاملThe combinatorial encoding of disjoint convex sets in the plane
We introduce a new combinatorial object, the double-permutation sequence, and use it to encode a family of mutually disjoint compact convex sets in the plane in a way that captures many of its combinatorial properties. We use this encoding to give a new proof of the Edelsbrunner-Sharir theorem that a collection of n compact convex sets in the plane cannot be met by straight lines in more than 2...
متن کاملStabbing Oriented Convex Polygons in Randomized O(n) Time
We present a randomized algorithm that determines, in expectedO(n2) time, whether a line exists that stabs each of a set of oriented convex polygons in R3 with a total of n edges. If a stabbing line exists, the algorithm computes at least one such line. We show that the computation amounts to constructing a convex polytope in R5 and inspecting its edges for intersections with a four-dimensional...
متن کاملDisjoint empty convex pentagons in planar point sets
Harborth [Elemente der Mathematik, Vol. 33 (5), 116–118, 1978] proved that every set of 10 points in the plane, no three on a line, contains an empty convex pentagon. From this it follows that the number of disjoint empty convex pentagons in any set of n points in the plane is least ⌊ n 10 ⌋. In this paper we prove that every set of 19 points in the plane, no three on a line, contains two disjo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1991
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90065-5